GRAPHS WITH CERTAINS FAMILIES OF SPANNING TREESERDOS P; FAUDREE RJ; ROUSSEAU CC et al.1982; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1982; VOL. 32; NO 2; PP. 162-170; BIBL. 7 REF.Article

ENUMERATION DES ARBRES MAXIMAUX D'UNE CLASSE DE GRAPHES BIPARTISKONONENKO AM; TRUKHANOVSKIJ NN.1978; VESCI AKAD. NAVUK B.S.S.R., FIZ.-MAT. NAVUK; BYS; DA. 1978; NO 6; PP. 111-113; ABS. ENG; BIBL. 4 REF.Article

COMPUTATIONAL EXPERIENCE WITH MINIMUM SPANNING TREE ALGORITHMSJARVIS JP; WHITED DE.1983; OPERATIONS RESEARCH LETTERS; ISSN 507679; NLD; DA. 1983; VOL. 2; NO 1; PP. 36-41; BIBL. 12 REF.Article

DOT PATTERN PROCESSING USING VORONOI NEIGHBORHOODSAHUJA N.1982; IEEE TRANS. PATTERN ANAL. MACH. INTELL.; ISSN 0162-8828; USA; DA. 1982; VOL. 4; NO 3; PP. 336-343; BIBL. 43 REF.Article

DELETING THE ROOT OF A HEAPDOBERKAT EE.1982; ACTA INFORMATICA; ISSN 0001-5903; DEU; DA. 1982; VOL. 17; NO 3; PP. 245-265; BIBL. 11 REF.Article

MESSAGES AS ACTIVE AGENTSWALL DW.1982; ANNUAL ASSOCIATION FOR COMPUTING MACHINERY SYMPOSIUM ON PRINCIPLES OF PROGRAMMING LANGUAGES. 9/1982-01-25/ALBUQUERQUE NM; USA; NEW YORK: ACM; DA. 1982; PP. 35-39; BIBL. 20 REF.Conference Paper

STRUCTURES DE DONNEES ET COMPLEXITE DES ALGORITHMES: REGARDS SUR LE PROBLEME DE L'ARBRE MAXIMAL DE POIDS EXTREMALFICHEFET J.1982; CAHIERS DU CENTRE D'ETUDES DE RECHERCHE OPERATIONNELLE; ISSN 0008-9737; BEL; DA. 1982; VOL. 24; NO 2-4; PP. 193-220; BIBL. 30 REF.Article

A DISTRIBUTED ALGORITHM FOR MINIMUM-WEIGHT SPANNING TREESGALLAGER RG; HUMBLET PA; SPIRA PM et al.1983; ACM TRANS. PROGRAM. LANG. SYST.; ISSN 0164-0925; USA; DA. 1983; VOL. 5; NO 1; PP. 66-77; BIBL. 9 REF.Article

TOPOLOGICAL DESIGN OF CENTRALIZED COMPUTER NETWORKS: FORMULATIONS AND ALGORITHMSGAVISH B.1982; NETWORKS; ISSN 0028-3045; USA; DA. 1982; VOL. 12; NO 4; PP. 355-377; BIBL. 44 REF.Article

MINIMAL COST-RELIABILITY RATIO SPANNING TREECHANDRASEKARAN R; ANEJA YP; NAIR KPK et al.1981; NORTH HOLL. MATH. STUD.; ISSN 0304-0208; NLD; DA. 1981; VOL. 59; PP. 53-60; BIBL. 7 REF.Conference Paper

MINIMAL SPANNING TREES AND PARTIAL SORTING = ARBRES DE RECOUVREMENT MINIMAUX ET TRI PARTIELBRENNAN JJ.1982; OPER. RES. LETT.; ISSN 507679; NLD; DA. 1982; VOL. 1; NO 3; PP. 113-116; BIBL. 13 REF.Article

COMPACT STORAGE SCHEMES FOR FORMATTED FILES BY SPANNING TREESERNVALL J; NEVALAINEN O.1979; ; BIT; DNK; DA. 1979; VOL. 19; NO 4; PP. 463-475; BIBL. 13 REF.Article

THE MIN-MAX SPANNING TREE PROBLEM AND SOME EXTENSIONS.CAMERINI PM.1978; INFORM. PROCESSG LETTERS; NETHERL.; DA. 1978; VOL. 7; NO 1; PP. 10-14; BIBL. 12 REF.Article

Improved parallel algorithms for finding the most vital edge of a graph with respect to minimum spanning treeHONG SHEN.International journal of computer mathematics. 2000, Vol 75, Num 2, pp 129-136, issn 0020-7160Article

A new evolutionary algorithm for spanning-tree based communication network designSOAK, Sang-Moon; CORNE, David; AHN, Byung-Ha et al.IEICE transactions on communications. 2005, Vol 88, Num 10, pp 4090-4093, issn 0916-8516, 4 p.Article

GRAPH THEORETICAL CLUSTERING BASED ON LIMITED NEIGHBOURHOOD SETSURQUHART R.1982; PATTERN RECOGN.; ISSN 0031-3203; USA; DA. 1982; VOL. 15; NO 3; PP. 173-187; BIBL. 35 REF.Article

ON CONSTRUCTING MINIMUM SPANNING TREES IN K-DIMENSIONAL SPACES AND RELATED PROBLEMSCHI CHIH YAO A.1982; SIAM J. COMPUT; ISSN 0097-5397; USA; DA. 1982; VOL. 11; NO 4; PP. 721-736; BIBL. 21 REF.Article

SENSITIVITY ANALYSIS OF MINIMUM SPANNING TREES AND SHORTEST PATH TREESTARJAN RE.1982; INFORMATION PROCESSING LETTERS; ISSN 0020-0190; NLD; DA. 1982; VOL. 14; NO 1; PP. 30-33; BIBL. 7 REF.Article

THE COMPLEXITY OF RESTRICTED SPANNING TREE PROBLEMSPAPADIMITRIOU CH; YANNAKAKIS M.1982; J. ASSOC. COMPUT. MACH.; ISSN 0004-5411; USA; DA. 1982; VOL. 29; NO 2; PP. 285-309; BIBL. 18 REF.Article

ALGORITHMS FOR GENERATING FUNDAMENTAL CYCLES IN A GRAPHDEO N; PRABHU GM; KRISHNAMOORTHY MS et al.1982; ACM TRANS. MATH. SOFTW.; ISSN 0098-3500; USA; DA. 1982; VOL. 8; NO 1; PP. 26-42; BIBL. 26 REF.Article

On the asymptotic growth rate of some spanning trees embedded in ℝ^dDE CASTRO, Pedro M. M; DEVILLERS, Olivier.Operations research letters. 2011, Vol 39, Num 1, pp 44-48, issn 0167-6377, 5 p.Article

The Number of Spanning Trees in a Class of Double Fixed-Step Loop NetworksXUERONG YONG; YUANPING ZHANG; GOLIN, Mordecai J et al.Networks (New York, NY). 2008, Vol 52, Num 2, pp 69-77, issn 0028-3045, 9 p.Article

On a condition for obtaining an explicit solution of optimum requirement spanning treeANAZAWA, T.Networks (New York, NY). 1999, Vol 34, Num 2, pp 132-135, issn 0028-3045Article

Optimum requirement spanning trees and reliability of tree networksANAZAWA, T; KODERA, T; JIMBO, M et al.Networks (New York, NY). 1999, Vol 34, Num 2, pp 122-131, issn 0028-3045Article

Minimum-weight spanning tree construction in O(log log n) communication roundsLOTKER, Zvi; PATT-SHAMIR, Boaz; PAVLOV, Elan et al.SIAM journal on computing (Print). 2006, Vol 35, Num 1, pp 120-131, issn 0097-5397, 12 p.Article